Pricing in Position Auctions and Online Advertising∗

نویسنده

  • M. Bumin Yenmez
چکیده

This paper analyzes position auctions with general pricing rules. In these auctions, there are several items to be allocated which are commonly ranked by agents with unit demand. The preeminent example of position auctions is the “generalized second-price” (GSP) auction used by major search engines to sell online advertising. Edelman et al. (2007) establish that the ex post equilibrium of the GSP auction and the dominant strategy equilibrium of the Vickrey-Clarke-Groves mechanism have identical ex post payoffs. I extend their result to ascending auctions with general pricing rules where the price for an item depends on the bids of agents who win lower ranked items in any “sensible” way, even if the agents have multidimensional types. JEL: C71, C78.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bid optimization in online advertisement auctions

We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and propose a bidding heuristic to optimize the utility for bidders by equalizing the return-on-investment for each bidder across all keywords. We show that natural auction mechanisms combined with this heuristic can experience chaotic cycling (as is the case with many current advertiseme...

متن کامل

Tutorial Proposal: Mechanism Design for Online Advertisement

Online advertising is a booming industry and is developing into a major advertising outlet for millions of firms. In 2004, in United States alone, firms spent $9.6 billion on online advertising, a nearly 33% increase over the spending in 2003 [11]. Analysts project that by 2009, the online advertising budget will reach $22.3 billion [5]. Various factors contribute to the unprecedented growth of...

متن کامل

Offline Evaluation of Response Prediction in Online Advertising Auctions

Click-through rates and conversion rates are two core machine learning problems in online advertising. The evaluation of such systems is often based on traditional supervised learning metrics that ignore how the predictions are used. These predictions are in fact part of bidding systems in online advertising auctions. We present here an empirical evaluation of a metric that is specifically tail...

متن کامل

Dynamic Online-Advertising Auctions as Stochastic Scheduling

We study dynamic models of online-advertising auctions in the Internet: advertisers compete for space on a web page over multiple time periods, and the web page displays ads in differentiated slots based on their bids and other considerations. The complex interactions between the advertisers and the website (which owns the web page) is modeled as a dynamic game. Our goal is to derive ad-slot pl...

متن کامل

Search Engine Advertising: Channel Substitution When Pricing Ads to Context

We explore substitution patterns across advertising platforms. Using data on the advertising prices paid by lawyers for 139 Google search terms in 195 locations, we exploit a natural experiment in ―ambulance-chaser‖ regulations across states. When lawyers cannot contact clients by mail, advertising prices per click for search engine advertisements are 5-7% higher. Therefore, online advertising ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009